Algorithms for computing the distributions of sums of discrete random variables
نویسندگان
چکیده
منابع مشابه
Algorithms for computing the distributions of sums of discrete random variables
We present algorithms for computing the probablity density function of the sum of two independent discrete random variables, along with an implementation of the algorithm in a computer algebra system. Some examples illustrate the utility of this algorithm. c © 2004 Elsevier Science Ltd. All rights reserved. Keywords—Computer algebra systems, Convolution, Probability.
متن کاملStrong Laws for Weighted Sums of Negative Dependent Random Variables
In this paper, we discuss strong laws for weighted sums of pairwise negatively dependent random variables. The results on i.i.d case of Soo Hak Sung [9] are generalized and extended.
متن کاملOptimal Algorithms for Generating Discrete Random Variables with Changing Distributions
We give optimal algorithms for generating discrete random variables for changing distributions. We discuss two models of how distributions may change. In both models, we obtain a solution with constant update time, constant expected generate time, and linear space.
متن کاملOn the Convergence Rate of the Law of Large Numbers for Sums of Dependent Random Variables
In this paper, we generalize some results of Chandra and Goswami [4] for pairwise negatively dependent random variables (henceforth r.v.’s). Furthermore, we give Baum and Katz’s [1] type results on estimate for the rate of convergence in these laws.
متن کاملOn the Complete Convergence ofWeighted Sums for Dependent Random Variables
We study the limiting behavior of weighted sums for negatively associated (NA) random variables. We extend results in Wu (1999) and a theorem in Chow and Lai (1973) for NA random variables.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2004
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2005.01.003